A Churn Resilience Technique on P2P Sensor Data Stream Delivery System Using Distributed Hashing

نویسندگان

  • Tomoya Kawakami
  • Yoshimasa Ishi
  • Tomoki Yoshihisa
  • Yuuichi Teranishi
چکیده

Recently, sensor data stream delivery system that collects sensor data periodically and delivers successively has been attracting great attention. As for this sensor data stream delivery, receivers are possible to require the same sensor data stream with different delivery cycles. Our research team proposed methods to distribute communication loads by relay nodes in the case of delivering the sensor data streams that have different data delivery cycles. However, in the previous methods, since the specific node builds delivery paths and notifies related nodes, the assigned node is required to be updated when the related nodes churn. Therefore, in this paper, we propose a churn resilience technique that enhances the robustness of delivery system. We confirmed in simulations that the proposed technique improves the reliability of the delivery system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized load balancing strategies with churn resilience in peer-to-peer networks

The objective of load balancing in peer-to-peer (P2P) networks is to balance the workload of peer nodes in proportion to their capacity so as to eliminate performance bottlenecks. It is challenging because of the dynamic nature in overlay networks, the time-varying load characteristics, and the inherent load imbalance caused by consistent hashing functions. It is known that simple randomized lo...

متن کامل

Behavior - aware P 2 P Protocol for High Data Availability

A lot of research papers discussed the Distributed Hash Table (DHT) based p2p systems to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and to handle churn, the system will generate the heavy information maintenance traffic to keep the efficiency of the DHT. Moreover, the previous researches c...

متن کامل

Heterogeneous Renewal Churn Model for Unstructured P2P Networks

Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g....

متن کامل

Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges

Labeling schemes for tree representation p. 13 Single-bit messages are insufficient in the presence of duplication p. 25 Safe composition of distributed programs communicating over order-preserving imperfect channels p. 32 Efficiently implementing LL/SC objects shared by an unknown number of processes p. 45 Placing a given number of base stations to cover a convex region p. 57 A state-space sea...

متن کامل

SChord: Handling Churn in Chord by Exploiting Node Session Time

Peer-to-peer systems are distinguished from traditional distributed systems in that nodes join and leave the p2p system at high rates, called churn problem. SChord, a p2p system, is illustrated in this paper, which is constructed on Chord system and aims to handle churn. We analyze the past experimental studies on churn of p2p systems and do some theoretical analysis on the probability distribu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Informatica (Slovenia)

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2015